Combined approximation algorithms for interactive design of road routes in CAD
نویسندگان
چکیده
Objectives . The aim of the work is to create algorithms for approximating a sequence points on plane by arcs clothoids and circles. Such problem typically arises in design railroad highway routes. plan (projection onto horizontal plane) road route curve (spline) consisting repeating bundle elements “straight line + clothoid arc circle ...”. combination provides continuity not only its tangent, but also curvature. Since number spline known advance, their parameters are subject restrictions, there no mathematically consistent algorithm this problem. two-stage scheme solving developed at RTU MIREA with lines circles (i.e., without elements). At first stage, uses dynamic programming determine elements. second optimizes using nonlinear programming. This has yet be implemented due significantly more complicated nature Therefore, plans existing computer aided (CAD) systems carried out interactive mode iterative selection In regard, it makes sense develop element-by-element approximation. Methods approximation formalized as lowdimensional non-linear objective function sum squared deviations from original points. can represented Cartesian coordinates power series, difficulties calculating derivatives respect desired proposed these based integral representation functions length. Results A mathematical model have been method second-order calculation inversion matrix (Hesse matrix). Conclusions For programming, necessary an analytical expression terms required variables. make possible calculate first, absence such expressions.
منابع مشابه
Algorithms for CAD Tools VLSI Design
Due to advent of Very Large Scale Integration (VLSI), mainly due to rapid advances in integration technologies the electronics industry has achieved a phenomenal growth over the last two decades. Various applications of VLSI circuits in high-performance computing, telecommunications, and consumer electronics has been expanding progressively, and at a very hasty pace. Steady advances in semi-con...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rossijskij tehnologi?eskij žurnal
سال: 2023
ISSN: ['2782-3210', '2500-316X']
DOI: https://doi.org/10.32362/2500-316x-2023-11-4-72-83